Multicommodity Flows and Polyhedra
نویسنده
چکیده
Seymour s conjecture on binary clutters with the so called weak or Q max ow min cut property implies if true a wide variety of results in combinatorial optimization about objects ranging from matchings to mul ticommodity ows and disjoint paths In this paper we review in particular the relation between classes of multicommodity ow problems for which the so called cut condition is su cient and classes of polyhedra for which Sey mour s conjecture is true
منابع مشابه
Uniform multicommodity flow in the hypercube with random edge capacities
We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge-capacities distributed like a random variable C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support sim...
متن کاملUniform multicommodity flows in the hypercube with random edge-capacities
We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge capacities distributed like C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support simultaneous multicom...
متن کاملOn Splittable and Unsplittable Ow Capacitated Network Design Arc{set Polyhedra
We study the polyhedra of splittable and unsplittable arc sets of multicommodity ow capac-itated network design problems. We investigate the optimization problems over these polyhedra and the separation and lifting problems of valid inequalities for them. In particular, we give a linear-time separation algorithm for the residual capacity inequalities (Magnanti et al., 1993) and show that the se...
متن کاملStable Multicommodity Flows
We extend the stable flow model of Fleiner to multicommodity flows. In addition to the preference lists of agents on trading partners for each commodity, every trading pair has a preference list on the commodities that the seller can sell to the buyer. A blocking walk (with respect to a certain commodity) may include saturated arcs, provided that a positive amount of less preferred commodity is...
متن کاملOptimal multicommodity flows in dynamic networks and algorithms for their finding
In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that cost functions, defined on edges, are nonlinear and depending on time and flow, and the demand function ...
متن کامل